Acyclic Orientation of Drawings
نویسندگان
چکیده
Given a set of curves in the plane or a topological graph, we ask for an orientation of the curves or edges which induces an acyclic orientation on the corresponding planar map. Depending on the maximum number of crossings on a curve or an edge, we provide algorithms and hardness proofs for this problem.
منابع مشابه
Algorithms and Bounds for Overloaded Orthogonal Drawings
Orthogonal drawings are widely used for graph visualization due to their high clarity and ease of representation. But when it comes to highdegree and massive graphs, even orthogonal drawings have difficulties producing a clean and simple visualization. In this paper we present a technique called Overloaded Orthogonal Drawing that greatly improves the readability by proposing a new vertex placem...
متن کاملDrawing Graphs by Example E ciently : Trees and Planar Acyclic Digraphs ? ( Extended Abstract )
Constraint-based graph drawing systems provide expressive power and exibility. Previously proposed approaches make use of general constraint solvers, which are ineecient, and of textual speciication of constraints, which can be long and diicult to understand. In this paper we propose the use of a constraint-based visual language for constructing planar drawings of trees, series-parallel graphs,...
متن کاملThe Number of Dependent Arcs in an Acyclic Orientation
Let G be a graph with n nodes, e edges, chromatic number and girth g. In an acyclic orientation of G, an arc is dependent if its reversal creates a cycle. It is well known that if < g, then G has an acyclic orientation without dependent arcs. Edelman showed that if G is connected, then every acyclic orientation has at most e ? n + 1 dependent arcs. We show that if G is connected and < g, then G...
متن کاملWeak Dominance Drawings and Linear Extension Diameter
We introduce the problem of Weak Dominance Drawing for general directed acyclic graphs and we show the connection with the linear extension diameter of a partial order P . We present complexity results and bounds.
متن کاملAcyclic 3-Colorings and 4-Colorings of Planar Graph Subdivisions
An acyclic coloring of a graph G is an assignment of colors to the vertices of G such that no two adjacent vertices receive the same color and every cycle in G has vertices of at least three different colors. An acyclic k-coloring of G is an acyclic coloring of G with at most k colors. It is NP-complete to decide whether a planar graph G with maximum degree four admits an acyclic 3-coloring [1]...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Graph Algorithms Appl.
دوره 14 شماره
صفحات -
تاریخ انتشار 2006